package leetcode.editor.cn.q0xx

class Q04 {
    fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double {
        if (nums1.size > nums2.size) {
            return findMedianSortedArrays(nums2, nums1)
        }
        val m = nums1.size
        val n = nums2.size
        var left = 0
        var right = m
        var mid1 = 0
        var mid2 = 0

        while (left <= right) {
            var i = (left + right) / 2
            var j = (m + n + 1) / 2 - i
        }

        TODO()
    }
}